import heapq
nums=[3,2,4,1]
min_heap = nums
heapq.heapify(min_heap)
print(min_heap)
for i in range(len(nums) - 1):
    min_heap.append(heapq.heappop(min_heap))
    print(min_heap)
print(min_heap)
s=[]
heapq.heappush(s,3)
heapq.heappush(s,4)
heapq.heappush(s,1)
print(s)########可以看出s即使是变成了小根堆，其类型依然是列表类型。
print('3'>'30')
print('30'>'3')
print('34'>'31')